Loss Probability Approximation of a Statistical Multiplexer and Its Application to Call Admission Control in High-speed Networks

نویسندگان

  • Fumio Ishizaki
  • Tetsuya Takine
  • Hiroaki Terada
  • Toshiharu Hasegawa
چکیده

| This paper studies the cell loss probability approximation of a statistical multiplexer in high speed networks. For this purpose, we consider discrete-time nite-bu er queueing models. We rst propose a simple approximate formula for the cell loss probability in terms of the tail distribution of the queue length in the corresponding in nite-bu er queue. Since the tail distribution has a simple asymptotic expression in many situations, we revisit the asymptotic analysis of the tail distribution. Furthermore we consider specific source tra c models which are particularly important in practice. The formula allows heterogeneous sources and each source is characterized only by a small number of parameters so that they meet engineering requirements. Combining those results, we propose a new call admission control (CAC) scheme which is based on the the cell loss probability as a measure of quality of services.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cell Loss Probability Approximations and Their Application to Call Admission Control

This paper studies the cell loss probability approximation of a statistical multiplexer in high speed networks. For this purpose, we consider discretetime nite-bu er queueing models. In particular, we study an approximate formula of the cell loss probability which is computed from the (asymptotic) tail distribution of the queue length in the corresponding in nite-bu er queue. We then apply the ...

متن کامل

A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks

In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...

متن کامل

Tight upper bounds for cell loss probabilitiesand required bandwidth estimation in

Estimating the cell loss probability in an ATM multiplexer is a key issue in network management and traac control tasks such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources. Based on this approximation, a simple...

متن کامل

Tight Upper Bounds for Cell Loss Probabilities in ATM Multiplexersand Required

Estimating the cell loss probability in an ATM multi-plexer is a key issue in network management and traac control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources with exponentially distributed on and oo pe...

متن کامل

Tight Upper Bounds for Cell Loss Probabilities in ATM

Estimating the cell loss probability in an ATM multi-plexer is a key issue in network management and traac control such as call admission control and bandwidth allocation. In this paper, we derive a new approximation to estimate the total and individual cell loss probabilities in an ATM multiplexer fed by a superposition of heterogeneous on-oo sources with exponentially distributed on and oo pe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995